Some Perspectives of Infinite-State Verification
نویسنده
چکیده
We report on recent progress in the study of infinite transition systems for which interesting properties (like reachability of designated states) can be checked algorithmically. Two methods for the generation of such models are discussed: the construction from simpler models via operations like unfolding and synchronized product, and the internal representation of state spaces by regular sets of words or trees.
منابع مشابه
Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation
We address the problem of the automated verification of temporal properties of infinite state reactive systems. We present some improvements of a verification method based on the specialization of constraint logic programs (CLP). First, we reformulate the verification method as a two-phase procedure: (1) in the first phase a CLP specification of an infinite state system is specialized with resp...
متن کاملExperiments in Infinite States Verification in Game-Theoretic Logics
Many practical problems where the environment is not in the system’s control such as service orchestration and contingent and multi-agent planning can be modelled in game-theoretic logics (e.g. ATL). But most work on verification methods for such logics is restricted to finite state cases. [De Giacomo et al., 2010] develops a situation calculusbased logical framework for representing such infin...
متن کاملNew explicit and Soliton Wave Solutions of Some Nonlinear Partial Differential Equations with Infinite Series Method
To start with, having employed transformation wave, some nonlinear partial differential equations have been converted into an ODE. Then, using the infinite series method for equations with similar linear part, the researchers have earned the exact soliton solutions of the selected equations. It is required to state that the infinite series method is a well-organized method for obtaining exact s...
متن کاملAutomata over Infinite Alphabets
In many contexts such as validation of XML data, software model checking and parametrized verification, the systems studied are naturally abstracted as finite state automata, but whose input alphabet is infinite. While use of such automata for verification requires that the non-emptiness problem be decidable, ensuring this is non-trivial, since the space of configurations of such automata is in...
متن کاملVerification of infinite-state dynamic systems using approximate quotient transition systems
This paper concerns computational methods for verifying properties of labeled infinite-state transition systems (e.g., hybrid systems) using quotient transition system (QTS). A QTS is a conservative approximation to the infinite-state transition system based on a finite partition of the infinite state space. For universal specifications, positive verification for a QTS implies the specification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005